翻訳と辞書 |
Union of two regular languages : ウィキペディア英語版 | Union of two regular languages
In formal language theory, and in particular the theory of nondeterministic finite automata, it is known that the union of two regular languages is a regular language. This article provides a proof of that statement. ==Theorem==
For any regular languages and , language is regular.'' ''Proof'' Since and are regular, there exist NFAs that recognize and . Let :: :: Construct ::
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Union of two regular languages」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|